Research Directions Profile in the Computing Museum of the Institute of Mathematics and Computer Science, University of Latvia (IMCS)

نویسندگان

  • Rihards Balodis
  • Juris Borzovs
  • Inara Opmane
  • Andrejs Skuja
  • Evija Ziemele
چکیده

The article describes the development of information technology in Latvia, in IMCS, to the middle of the 1990s. The history of IMCS represents the usage of computers in typical computing centers in the former Soviet Union and the transformation from computing center to research institution. It also represents Latvian collaboration with the Nordic countries that provided political, scientific, and technological support. Historical documents, computer parts, and photos are collected in the Computer Museum of IMCS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON ALGEBRAIC AND COALGEBRAIC CATEGORIES OF VARIETY-BASED TOPOLOGICAL SYSTEMS

Motivated by the recent study on categorical properties of latticevalued topology, the paper considers a generalization of the notion of topological system introduced by S. Vickers, providing an algebraic and a coalgebraic category of the new structures. As a result, the nature of the category   TopSys   of S. Vickers gets clari ed, and a metatheorem is stated, claiming that (latticevalu...

متن کامل

POWERSET OPERATOR FOUNDATIONS FOR CATALG FUZZY SET THEORIES

The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...

متن کامل

New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups

In this paper, a new  algorithm for computing secondary invariants of  invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants.  The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...

متن کامل

TOWARDS THE THEORY OF L-BORNOLOGICAL SPACES

The concept of an $L$-bornology is introduced and the theory of $L$-bornological spacesis being developed. In particular the lattice of all $L$-bornologies on a given set is studied and basic properties ofthe category of $L$-bornological spaces and bounded mappings are investigated.

متن کامل

Comparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice

A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010